On the Global Convergence of a Filter--SQP Algorithm
نویسندگان
چکیده
منابع مشابه
On the superlinear local convergence of a filter-SQP method
Transition to superlinear local convergence is shown for a modified version of the trust-region filter-SQP method for nonlinear programming introduced by Fletcher, Leyffer, and Toint [8]. Hereby, the original trust-region SQP-steps can be used without an additional second order correction. The main modification consists in using the Lagrangian function value instead of the objective function va...
متن کاملUsing Modified IPSO-SQP Algorithm to Solve Nonlinear Time Optimal Bang-Bang Control Problem
In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...
متن کاملGlobal convergence of a general filter algorithm based on an efficiency condition of the step
In this work we discuss global convergence of a general filter algorithm that does not depend neither on the definition of the forbidden region, which can be given by the original or slanting filter rule, nor on the way in which the step is computed. This algorithm basically consists of calculating a point not forbidden by the filter from the current point. Assuming that this step must be effic...
متن کاملGlobal Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
A trust-region SQP-filter algorithm of the type introduced by Fletcher and Leyffer [Math. Program., 91 (2002), pp. 239–269] that decomposes the step into its normal and tangential components allows for an approximate solution of the quadratic subproblem and incorporates the safeguarding tests described in Fletcher, Leyffer, and Toint [On the Global Convergence of an SLPFilter Algorithm, Technic...
متن کاملA Nonmonotone Filter Method for Minimax Problems
In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function a...
متن کاملSwitching Stepsize Strategies for SQP
An SQP algorithm is presented for solving constrained nonlinear programming problems. The algorithm uses three stepsize strategies in order to achieve global and superlinear convergence. Switching rules are implemented that combine the merits and avoid the drawbacks of the three stepsize strategies. A penalty parameter is determined using an adaptive strategy that aims to achieve sufficient dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 13 شماره
صفحات -
تاریخ انتشار 2002